Probabilistic Assignment: A Two-fold Axiomatic Approach
نویسنده
چکیده
We study the problem of allocating objects by means of probabilistic mechanisms. Each agent has strict preferences over objects and ex post receives exactly one object. A standard approach in the literature is to extend agents' preferences over objects to preferences over lotteries de ned on those objects, using the rst-order stochastic dominance criterion, or the sd-extension. In a departure from this practice, we work with a general mapping, called an extension, from preferences over objects to preferences over lotteries. Our objective is to connect the extension operator theory in Cho (2012) with probabilistic assignment while maintaining an axiomatic perspective on each. Our main results concern axioms associated with the sd-, dl-, and ul-extensions. First, sd-e ciency, dl-e ciency, and ul-e ciency are equivalent (axioms are pre xed by the extensions they are associated with). Also, for each e ∈ {sd, dl, ul}, e-adjacent strategy-proofness is equivalent to e-strategy-proofness. For each e ∈ {sd, dl, ul}, a rule is e-strategy-proof i the welfare of each agent weakly decreases as he reports preference relations that are further and further away from the truth. Moreover, sd-strategy-proofness is equivalent to dl-strategy-proofness and ul-strategy-proofness. Finally, we propose a family of rules that generalizes the serial rule. Journal of Economic Literature Classi cation Numbers: C70, C78, D61, D63
منابع مشابه
Partial Strategyproofness: An Axiomatic Approach to Relaxing Strategyproofness for Assignment Mechanisms
We present partial strategyproofness, a new, relaxed notion of strategyproofness to study the incentive properties of non-strategyproof assignment mechanisms. Under partially strategyproof mechanisms, truthful reporting is a dominant strategy for agents who have sufficiently different valuations for different objects. A single numerical parameter, the degree of strategyproofness, controls the e...
متن کاملThe Social Entropy Process: Axiomatising the Aggregation of Probabilistic Beliefs
The present work stems from a desire to combine ideas arising from two historically different schemes of probabilistic reasoning, each having its own axiomatic traditions, into a single broader axiomatic framework, capable of providing general new insights into the nature of probabilistic inference in a collective context. In the present sketch of our work we describe briefly the background con...
متن کاملA Novel Approach to Design of Truss-Beams for Natural Frequency
Here, we present a novel two-step approach for optimum design of cellular truss-beams based on desired natural frequencies. The proposed approach at- tempts to decrease the design complexities, based on the so called Axiomatic Design, before any eort to solve the physical problem itself. It also serves as a generic approach which nds its generality through dimensional analysis with its accuracy...
متن کاملRevisiting Consistency in House Allocation Problems and the Computational Approach to the Axiomatic Method
How should we allocate a social endowment of objects among a group of agents when monetary compensation is not possible? Typical examples are the assignment of offices among faculty and the assignment of tasks among subalterns. We follow an axiomatic approach and impose two properties on rules: Pareto-efficiency and consistency. Previous research arrived at a “dictatorship” result imposing anot...
متن کاملProbit-Based Traffic Assignment: A Comparative Study between Link-Based Simulation Algorithm and Path-Based Assignment and Generalization to Random-Coefficient Approach
Probabilistic approach of traffic assignment has been primarily developed to provide a more realistic and flexible theoretical framework to represent traveler’s route choice behavior in a transportation network. The problem of path overlapping in network modelling has been one of the main issues to be tackled. Due to its flexible covariance structure, probit model can adequately address the pro...
متن کامل